Optimal Mittag–Leffler Summation
نویسندگان
چکیده
A novel method of an optimal summation is developed that allows for calculating from small-variable asymptotic expansions the characteristic amplitudes variables tending to infinity. The in two versions, as self-similar Borel–Leroy or Mittag–Leffler summations. It based on optimized iterated roots approximants applied and Mittag–Leffler- transformed series with subsequent inverse transformations. As a result, simple transparent expressions critical are obtained explicit form. control parameters come into play They determined optimization procedure, either minimal derivative difference conditions, imposed analytically expressed amplitudes. After diff-log transformation, virtually same procedure can be indices at results number various examples. examples vary rapid growth coefficients fast decay, well intermediate cases. methods give good estimates large-variable exponents. works uniformly wider variety
منابع مشابه
Symbolic Summation Finds Optimal Nested Sum Representations
We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain symbolic summation algorithms that solve this problem for sums defined, e.g., over hypergeometric, q-hypergeometric or mixed hypergeometric expressions.
متن کاملA Symbolic Summation Approach to Find Optimal Nested Sum Representations
We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain a symbolic summation framework that solves this problem for sums defined, e.g., over hypergeometric, q-hypergeometric or mixed hypergeometric expressions. Recently, our methods have found applications in quantum field theory.
متن کاملSimple summation rule for optimal fixation selection in visual search
When searching for a known target in a natural texture, practiced humans achieve near-optimal performance compared to a Bayesian ideal searcher constrained with the human map of target detectability across the visual field [Najemnik, J., & Geisler, W. S. (2005). Optimal eye movement strategies in visual search. Nature, 434, 387-391]. To do so, humans must be good at choosing where to fixate dur...
متن کاملDiscrete Summation
These theories introduce basic concepts and proofs about discrete summation: shifts, formal summation, falling factorials and stirling numbers. As proof of concept, a simple summation conversion is provided. 1 Stirling numbers of first and second kind theory Stirling imports Main begin 1.1 Stirling numbers of the second kind fun Stirling :: nat ⇒ nat ⇒ nat where Stirling 0 0 = 1 | Stirling 0 (S...
متن کاملGosper’s Algorithm and Accurate Summation as Definite Summation Tools
Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper’s algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is inreased.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11050202